package com.review.dp;

public class LC_198 {
    public static int rob(int[] nums) {
        if (nums.length==0){
            return 0;
        }else if (nums.length==1){
            return nums[0];
        }
        int n = nums.length;
        int[] dp = new int[n];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < n; i++) {
            dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        return dp[n - 1];
    }

    public static void main(String[] args) {
        int[] ints = {1, 2, 3, 1};
        System.out.println(rob(ints));
    }
}
